#include "binaryTree.h"

using namespace DataStructures;

BinaryTree::BinaryTree()
{
	numberOfItems = 0;
}

BinaryTree::~BinaryTree()
{

}

BinaryTreeNode* BinaryTree::Find(int data)
{
	BinaryTreeNode* node = new BinaryTreeNode(0);
	
	return node;
}

void BinaryTree::Insert(int data)
{
	BinaryTreeNode* node = new BinaryTreeNode(data);
	
	if(numberOfItems == 0)
	{
		//rootNode = node;
	}
	else
	{

	}

	numberOfItems++;
}

/*
void Delete(int id)
{

}
*/
void BinaryTree::PrintTree()
{
	cout << "Tree contents: " << (*rootNode).GetData() << endl;
}